Adaptive Multilevel Methods with Local Smoothing
نویسنده
چکیده
A multilevel method on adaptive meshes with hanging nodes is derived. Smoothing is restricted to the interior of the subdomains refined to the current level, thus has optimal computational complexity. Its convergence rates are the same as for the the non-adaptive version. We discuss the implementation in a general finite element code at the example of the deal.II library.
منابع مشابه
Optimality of local multilevel methods on adaptively refined meshes for elliptic boundary value problems
A local multilevel product algorithm and its additive version are analyzed for linear systems arising from the application of adaptive finite element methods to second order elliptic boundary value problems. The abstract Schwarz theory is applied to verify uniform convergence of local multilevel methods featuring Jacobi and Gauss-Seidel smoothing only on local nodes. By this abstract theory, co...
متن کاملLocal Multilevel Methods for Adaptive Nonconforming Finite Element Methods
In this paper, we propose a local multilevel product algorithm and its additive version for linear systems arising from adaptive nonconforming finite element approximations of second order elliptic boundary value problems. The abstract Schwarz theory is applied to analyze the multilevel methods with Jacobi or Gauss-Seidel smoothers performed on local nodes on coarse meshes and global nodes on t...
متن کاملA new adaptive exponential smoothing method for non-stationary time series with level shifts
Simple exponential smoothing (SES) methods are the most commonly used methods in forecasting and time series analysis. However, they are generally insensitive to non-stationary structural events such as level shifts, ramp shifts, and spikes or impulses. Similar to that of outliers in stationary time series, these non-stationary events will lead to increased level of errors in the forecasting pr...
متن کاملCoarsening, Sampling, and Smoothing: Elements of the Multilevel Method
The multilevel method has emerged as one of the most eeective methods for solving numerical and combinatorial problems. It has been used in multigrid, domain decomposition, geometric search structures, as well as optimization algorithms for problems such as partitioning and sparse-matrix ordering. This paper presents a systematic treatment of the fundamental elements of the multilevel method. W...
متن کاملA Particle-Partition of Unity Method Part VI: A p-robust Multilevel Solver
In this paper we focus on the efficient multilevel solution of linear systems arising from a higher order discretization of a second order partial differential equation using a partition of unity method. We present a multilevel solver which employs a tree-based spatial multilevel sequence in conjunction with a domain decomposition type smoothing scheme. The smoother is based on an overlapping s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010